The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
In this note, we give tighter bounds on the complexity of the bipartite unique perfect matching problem, bipartite-UPM. We show that the problem is in C=L and in NL ⊕ L, both subclasses of NC2. We also consider the (unary) weighted version of the problem. We show that testing uniqueness of the minimum-weight perfect matching problem for bipartite...
Under the assumption that NP does not have p-measure 0, we investigate reductions to NP-complete sets and prove the following: 1 Adaptive reductions are more powerful than nonadaptive reductions: there is a problem that is Turing-complete for NP but not truth-table-complete. 2 Strong nondeterministic reductions are more powerful than deterministic reductions: there is a problem that...
We identify a new genre of algorithmic problems – design problems – and study them from an algorithmic and complexity-theoretic view point. We use the learning techniques of Freund-Schapire [FS99] and its generalizations to show that for a large class of problems, the design version is as easy as the optimization version.
While the 3-dimensional analogue of Sperner’s problem in the plane was known to be complete in class PPAD, the complexity of 2D-SPERNER itself is not known to be PPAD-complete or not. In this paper, we settle this open problem proposed by Papadimitriou [9] fifteen years ago. The result also allows us to derive the computational complexity characterization of a discrete version of the 2-dimensional...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.